Spatial Sigma-Delta Modulation for Coarsely Quantized Massive MIMO Downlink: Flexible Designs by Convex Optimization

This paper considers the context of multiuser massive MIMO downlink precoding with low-resolution digital-to-analog converters (DACs) at the transmitter. This subject is motivated by the consideration that it is expensive to employ high-resolution DACs for practical massive MIMO implementations. The challenge with using low-resolution DACs is to overcome the detrimental quantization error effects. Recently, spatial Sigma-Delta modulation has arisen as a viable way to put quantization errors under control. This approach takes insight from temporal Sigma-Delta modulation in classical DAC studies. Assuming a 1D uniform linear transmit antenna array, the principle is to shape the quantization errors in space such that the shaped quantization errors are pushed away from the user-serving angle sector. In the previous studies, spatial Sigma-Delta modulation was performed by direct application of the basic first- and second-order modulators from the Sigma-Delta literature. In this paper, we develop a general Sigma-Delta modulator design framework for any given order, for any given number of quantization levels, and for any given angle sector. We formulate our design as a problem of maximizing the signal-to-quantization-and-noise ratios experienced by the users. The formulated problem is convex and can be efficiently solved by available solvers. Our proposed framework offers the alternative option of focused quantization error suppression in accordance with channel state information. Our framework can also be extended to 2D planar transmit antenna arrays. We perform numerical study under different operating conditions, and the numerical results suggest that, given a moderate number of quantization levels, say, 5 to 7 levels, our optimization-based Sigma-Delta modulation schemes can lead to bit error rate performance close to that of the unquantized counterpart

Transmitting Data Through Reconfigurable Intelligent Surface: A Spatial Sigma-Delta Modulation Approach

Transmitting data using the phases on reconfigurable intelligent surfaces (RIS) is a promising solution for future energy-efficient communication systems. Recent work showed that a virtual phased massive multiuser multiple-input-multiple-out (MIMO) transmitter can be formed using only one active antenna and a large passive RIS. In this paper, we are interested in using such a system to perform MIMO downlink precoding. In this context, we may not be able to apply conventional MIMO precoding schemes, such as the simple zero-forcing (ZF) scheme, and we typically need to design the phase signals by solving optimization problems with constant modulus constraints or with discrete phase constraints, which pose challenges with high computational complexities. In this work, we propose an alternative approach based on Sigma-Delta ($\Sigma\Delta$) modulation, which is classically famous for its noise-shaping ability. Specifically, first-order $\Sigma\Delta$ modulation is applied in the spatial domain to handle phase quantization in generating constant envelope signals. Under some mild assumptions, the proposed phased $\Sigma\Delta$ modulator allows us to use the ZF scheme to synthesize the RIS reflection phases with negligible complexity. The proposed approach is empirically shown to achieve comparable bit error rate performance to the unquantized ZF scheme

Directed symbolic execution

In this paper, we study the problem of automatically finding program executions that reach a particular target line. This problem arises in many debugging scenarios, e.g., a developer might learn that a failure is possible on a particular line but might not know exactly how to reproduce the failure or even whether it is reproducible. This can happen particularly often for bug reports from static analysis tools, which can produce false positives. We propose two new directed symbolic execution strategies that aim to solve this problem: shortest-distance symbolic execution (SDSE) uses a distance metric in an interprocedural control flow graph to guide symbolic execution toward a particular target; and call-chain-backward symbolic execution (CCBSE) iteratively runs forward symbolic execution, starting in the function containing the target line, and then jumping backward up the call chain until it finds a feasible path from the start of the program. We also propose Mix- CCBSE, a strategy in which CCBSE is composed with another search strategy to yield a hybrid that is more powerful than either strategy alone. We compare SDSE, CCBSE, and Mix-CCBSE with several existing strategies from the literature. We find that, while SDSE performs extremely well in many cases, it sometimes fails badly. However, by mixing CCBSE with KLEE's search strategy, we obtain a strategy that has the best overall performance across the strategies we studied

Evaluating Interaction Patterns in Configurable Software Systems

Many modern software systems are designed to be highly configurable, which makes testing them a challenge. One popular approach is combinatorial configuration testing, which, given an interaction strength $t$, computes a set of configurations to test such that all $t$-way combinations of option settings appear at least once. Basically, this approach assumes that interactions are complete in the sense that any combination of $t$ options can interact and therefore must be tested. We conjecture, however, that in practical systems interactions are limited. If our conjecture is true, then new techniques might be developed to identify or approximate infeasible interactions, greatly reducing the number of configurations that must be tested. We evaluated this conjecture with an initial empirical study of several configurable software systems. In this study we used symbolic evaluation to analyze how the settings of run-time configuration options affected a test suite's line coverage. Our results strongly suggest that for these subject programs, test suites and configuration options, at least at the level of line coverage, interactions between configuration options are not complete

Efficiently Manifesting Asynchronous Programming Errors in Android Apps

Android, the #1 mobile app framework, enforces the single-GUI-thread model, in which a single UI thread manages GUI rendering and event dispatching. Due to this model, it is vital to avoid blocking the UI thread for responsiveness. One common practice is to offload long-running tasks into async threads. To achieve this, Android provides various async programming constructs, and leaves developers themselves to obey the rules implied by the model. However, as our study reveals, more than 25% apps violate these rules and introduce hard-to-detect, fail-stop errors, which we term as aysnc programming errors (APEs). To this end, this paper introduces APEChecker, a technique to automatically and efficiently manifest APEs. The key idea is to characterize APEs as specific fault patterns, and synergistically combine static analysis and dynamic UI exploration to detect and verify such errors. Among the 40 real-world Android apps, APEChecker unveils and processes 61 APEs, of which 51 are confirmed (83.6% hit rate). Specifically, APEChecker detects 3X more APEs than the state-of-art testing tools (Monkey, Sapienz and Stoat), and reduces testing time from half an hour to a few minutes. On a specific type of APEs, APEChecker confirms 5X more errors than the data race detection tool, EventRacer, with very few false alarms

Sex- and age-dependent association of SLC11A1 polymorphisms with tuberculosis in Chinese: a case control study

BACKGROUND: Host genetic factors are important determinants in tuberculosis (TB). The SLC11A1 (or NRAMP1) gene has been studied extensively for genetic association with TB, but with inconsistent findings. In addition, no study has yet looked into the effect of sex and age on the relationship between SLC11A1 polymorphisms and TB. METHODS: A case-control study was conducted. In total, 278 pulmonary TB patients and 282 sex- and age-matched controls without TB were recruited. All subjects were ethnic Chinese. On the basis of linkage disequilibrium pattern, three genetic markers from SLC11A1 and one from the nearby IL8RB locus were selected and examined for association with TB susceptibility. These markers were genotyped using single strand conformation polymorphism analysis or fragment analysis of amplified products. RESULTS: Statistically significant differences in allele (P = 0.0165, OR = 1.51) and genotype (P = 0.0163, OR = 1.59) frequencies of the linked markers SLC6a/b (classically called D543N and 3'UTR) of the SLC11A1 locus were found between patients and controls. With stratification by sex, positive associations were identified in the female group for both allele (P = 0.0049, OR = 2.54) and genotype (P = 0.0075, OR = 2.74) frequencies. With stratification by age, positive associations were demonstrated in the young age group (age ≤65 years) for both allele (P = 0.0047, OR = 2.52) and genotype (P = 0.0031, OR = 2.92) frequencies. All positive findings remained significant even after correction for multiple comparisons. No significant differences were noted in either the male group or the older age group. No significant differences were found for the other markers (one SLC11A1 marker and one IL8RB marker) either. CONCLUSION: This study confirmed the association between SLC11A1 and TB susceptibility and demonstrated for the first time that the association was restricted to females and the young age group

The utility of screening for perinatal depression in the second trimester among Chinese: a three-wave prospective longitudinal study

This paper aims to study the pattern of perinatal depressive symptomatology and determine the predictive power of second trimester perinatal depressive symptoms for future perinatal periods. A population-based sample of 2,178 women completed the Edinburgh Postnatal Depression Scale (EPDS) in the second and third trimesters and at 6 weeks postpartum. Repeated measures ANOVAs were used to determine the EPDS scores across three stages. The predictive power of the second trimester EPDS score in identifying women with an elevated EPDS score in the third trimester and at 6 weeks postpartum were determined. The predictive power of the second trimester EPDS score was further assessed using stepwise logistic regression and receiver operator characteristic curves. EPDS scores differed significantly across three stages. The rates were 9.9%, 7.8%, and 8.7% for an EPDS score of >14 in the second and third trimesters and at 6 weeks postpartum, respectively. Using a cut-off of 14/15, the second trimester EPDS score accurately classified 89.6% of women in the third trimester and 87.2% of those at 6 weeks postpartum with or without perinatal depressive symptomatology. Women with a second trimester EPDS score >14 were 11.78 times more likely in the third trimester and 7.15 times more likely at 6 weeks postpartum to exhibit perinatal depressive symptomatology after adjustment of sociodemographic variables. The area under the curve for perinatal depressive symptomatology was 0.85 in the third trimester and 0.77 at 6 weeks postpartum. To identify women at high risk for postpartum depression, healthcare professionals could consider screening all pregnant women in the second trimester so that secondary preventive intervention may be implemented

IMPROVING PROGRAM TESTING AND UNDERSTANDING Via Symbolic Execution

Symbolic execution is an automated technique for program testing that has recently become practical, thanks to advances in constraint solvers. Generally speaking, a symbolic executor interprets a program with symbolic inputs, systematically enumerating execution paths induced by the symbolic inputs and the program’s control flow. In this dissertation, I discuss the architecture and implementation of Otter, a symbolic execution framework for C programs, and work that uses Otter to solve two program analysis problems. Firstly, we use Otter to solve the line reachability problem—given a line target in a program, find inputs that drive the program to the line. We propose two new directed search strategies, one using a distance metric to guide symbolic execution towards the target, and another iteratively running symbolic execution from the start of the function containing the target, then jumping backward up the call chain to the start of the program. We compare variants of these strategies with several existing undirected strategies from the literature on a suite of 9 GNU Coreutils programs. We find that most directed strategies perform extremely well in manycases, although they sometimes fail badly

Infinite prefix codes for geometric distributions

Optimal (minimum cost) binary prefix codes for infinite sources with geometrically distributed frequencies, e.g. , P = {pi(1 - p)}i=0∞<, 0 < p < 1, were first (implicitly) suggested by Golomb over thirty years ago in the context of run-length encodings. Ten years later Gallager and Van Voorhis exhibited such optimal codes for all values of p. Just recently Merhav, Seroussi and Weinberger extended this further to find optimal binary prefix codes for two-sided geometric distributions. These codes were derived by cleverly "guessing" optimal codes for finite sources, validating these guesses by using the sibling property of Huffman encoding, and then showing that the finite codes converge in a very specific sense to an optimal infinite one. In this thesis we describe the first algorithmic approach to constructing optimal prefix infinite codes. Our approach is to define an infinite weighted graph with the property that the least cost infinite path in the graph corresponds to the optimal code. We then show that even though the graph is infinite, the least-cost infinite path has a repetitive structure and that it is therefore possible to not only find this path but to find it relatively efficiently. This approach will work for even more complicated generalizations of geometric sources where solutions cannot be guessed as well as in extensions of Huffman-coding for which the Huffman algorithm no longer works, e.g., non-uniform cost encoding alphabet characters and/or other restrictions on the codewords. We illustrate our approach by deriving an algorithm for constructing optimal prefix free codes with a geometric source for the telegraph channel. We also implement our algorithm and show what the constructed codes look like in this case